Sparse Distributed Memory and Related Models
نویسنده
چکیده
This paper describes sparse dislributed memory (SDM) as a neural-net associative memory. It is characterized by two weight matrices and by a large internal dimension-the number of hidden units is much larger than the number of input or output units. The first man'ix, A, is fixed and possibly random, and the second matrix, C, is modifiable. The paper compares and contrasts SDM to (1) computer memory, (2) correlation-matrix memory, (3) feed-forward artificial neural network, (4) cortex of the cerebellum, (5) Mart and Albus models of the cerebellum, and (6) Albus' cerebellar model arithmetic computer (CMAC). Several variations of the basic SDM design are discussed: the selected-coordinate and hyperplane designs of Jaeckel, the pseudorandom associative neural memory of Hassoun, and SDM with real-valued input variables by Prager and Fallside. SDM research conducted mainly at RIACS in 1986-1991 is highlighted. 3 To appear as Chapter_'_n H. M. Hassoun, ed. Associative Neural Memories." Theory and Implementation. New York: Oxford University Press. PRECEDING PAGE BLA,NK NOr F_LMED °,. 111 l
منابع مشابه
Approximating Bayesian inference with a sparse distributed memory system
Probabilistic models of cognition have enjoyed recent success in explaining how people make inductive inferences. Yet, the difficult computations over structured representations that are often required by these models seem incompatible with the continuous and distributed nature of human minds. To reconcile this issue, and to understand the implications of constraints on probabilistic models, we...
متن کاملVoice-based Age and Gender Recognition using Training Generative Sparse Model
Abstract: Gender recognition and age detection are important problems in telephone speech processing to investigate the identity of an individual using voice characteristics. In this paper a new gender and age recognition system is introduced based on generative incoherent models learned using sparse non-negative matrix factorization and atom correction post-processing method. Similar to genera...
متن کاملParallel Solution of Sparse Linear Least Squares Problemson Distributed - Memory
This paper studies the solution of large-scale sparse linear least squares problems on distributed-memory multiprocessors. The method of corrected semi-normal equations is considered. New block-oriented parallel algorithms are developed for solving the related sparse triangular systems. The arithmetic and communication complexities of the new algorithms applied to regular grid problems are anal...
متن کاملP-sparslib: a Portable Library of Distributed Memory Sparse Iterative Solvers
Domain Decomposition techniques constitute an important class of methods which are especially appropriate in a parallel computing environment. However, few general purpose computational codes based on these techniques have been developed so far. In this paper, we propose one such solver developed around the idea of `distributed sparse matrices'. We explore issues related to data structures for ...
متن کاملModeling 1D Distributed-Memory Dense Kernels for an Asynchronous Multifrontal Sparse Solver
To solve sparse linear systems multifrontal methods rely on dense partial LU decompositions of so-called frontal matrices; we consider a parallel, asynchronous setting in which several frontal matrices can be factored simultaneously. In this context, to address performance and scalability issues of acyclic pipelined asynchronous factorization kernels, we study models to revisit properties of le...
متن کامل